Strategic Re ection ?
نویسنده
چکیده
The Maude system incorporates reeective capabilities that enable quite sophisticated strategies to be expressed very conveniently. Maude's strategy languages have been used to control the execution of large and small rewriting systems, in several areas of application. Strategies have been used to encode winning strategies for games, and can also be used for more serious purposes, such as theorem-proving strategies, and strategies taking the place of model checkers or nite-state exploration tools in the analysis of nite-state systems. In particular, nite-or innnite-state systems, such as secure communication protocols, can be speciied in rewriting logic and can be subjected to formal analysis through strategies at the metalevel. Communication protocols can be speciied as concurrent object-oriented systems communicating through message passing, and can be executed as Maude programs. Nondetermin-istic behavior such as the order of messages arrival in such protocols can be controlled via strategies at the metalevel so that all possible behaviors of a system are explored. Previously-known and previously-unknown attacks or aws in cryptographic and multicast protocols have been discovered through the use of Maude's strategy mechanisms. In this paper several examples of the successful use of this and other kinds of strategies are pointed out.
منابع مشابه
Notes on local re ection principles
We study the hierarchy of re ection principles obtained by restricting the full local re ection schema to the classes of the arithmetical hierarchy Optimal conservation results w r t the arithmetical complexity for such principles are obtained Re ection principles for an arithmetical theory T are formal schemata ex pressing the soundness of T that is the statement that every sentence provable i...
متن کاملReflection principles in computational logic
Dell'Acqua, P. 1998: Re ection Principles in Computational Logic, Uppsala Theses in Computing Science 30. 154pp. Uppsala. ISSN 0283-359X, ISBN 91-5061298-0. We introduce the concept of re ection principles as a knowledge representation paradigm in a computational logic setting. Re ection principles are expressed as certain kinds of logic schemata intended to capture the basic properties of the ...
متن کاملTowards Spetses I
We present a formalization using data uniquely de ned at the level of the Weyl group of the construction and combinatorial properties of unipotent character shea ves and unipotent characters for reductive algebraic groups over an algebraic closure of a nite eld This formalization extends to the case where the Weyl group is re placed by a complex re ection group and in many cases we get families...
متن کاملTransforming Teaching Practice: becoming the critically re ̄ective teacher
This article proposes a framework for conceptualizing developing as a critically re ̄ective teacher. The author posits that critical re ̄ection is the distinguishing attribute of re ̄ective practitioners. The term critical re ̄ection as developed here merges critical inquiry, the conscious consideration of the ethical implications and consequences of teaching practice, with self-re ̄ection, deep exa...
متن کاملConcern Oriented Programming using Re ection
Building softwares in a concern oriented fashion can be splited in two main steps : rst de ning each concern separately (or reusing existing ones) and then composing (i.e. integrating) those concerns together. Among existing approaches to support this development scheme, we are interested in re ection. This interest is particularly motivated by the natural separation between functional and non-...
متن کاملInduction rules re ection principles and provably recursive functions
A well known result states that over basic Kalmar elementary arith metic EA the induction schema for n formulas is equivalent to the uniform re ection principle for n formulas n We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of re ection principles as well Thus the closure of EA under the induction rule for n or n for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998